ว ตถ ประสงค ของบทเร ยน

Similar documents
Logic. Combinational. inputs. outputs. the result. system can

COMBINATIONAL LOGIC FUNCTIONS

Combinational Logic. By : Ali Mustafa

Digital Logic Design ENEE x. Lecture 14

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.

Chapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 19, 23, 30, 33]

Class Website:

Systems I: Computer Organization and Architecture

DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute

CMSC 313 Lecture 18 Midterm Exam returned Assign Homework 3 Circuits for Addition Digital Logic Components Programmable Logic Arrays

Design of Combinational Logic

COMBINATIONAL LOGIC CIRCUITS. Dr. Mudathir A. Fagiri

Chapter 3 Combinational Logic Design

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

Unit 3 Session - 9 Data-Processing Circuits

Logic and Computer Design Fundamentals. Chapter 5 Arithmetic Functions and Circuits

Carry Look Ahead Adders

UNIT II COMBINATIONAL CIRCUITS:

Combina-onal Logic Chapter 4. Topics. Combina-on Circuit 10/13/10. EECE 256 Dr. Sidney Fels Steven Oldridge

Combinational Logic. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C.

CMSC 313 Lecture 18 Midterm Exam returned Assign Homework 3 Circuits for Addition Digital Logic Components Programmable Logic Arrays

UNIT 1. BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS

Function of Combinational Logic ENT263

Combinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan

Section 3: Combinational Logic Design. Department of Electrical Engineering, University of Waterloo. Combinational Logic

Combinational Logic. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C.

IT T35 Digital system desigm y - ii /s - iii

ELCT201: DIGITAL LOGIC DESIGN

CSEE 3827: Fundamentals of Computer Systems. Combinational Circuits

SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER

Menu. Binary Adder EEL3701 EEL3701. Add, Subtract, Compare, ALU

Combinational Logic Design Arithmetic Functions and Circuits

Combinational Logic Design Combinational Functions and Circuits

CHAPTER1: Digital Logic Circuits Combination Circuits

Sample Test Paper - I

CSE 140 Lecture 11 Standard Combinational Modules. CK Cheng and Diba Mirza CSE Dept. UC San Diego

CHAPTER VI COMBINATIONAL LOGIC BUILDING BLOCKS

Combinational Logic. Course Instructor Mohammed Abdul kader

ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks

Hardware Design I Chap. 4 Representative combinational logic

Chap 2. Combinational Logic Circuits

Digital Electronics Circuits 2017

Fundamentals of Digital Design

211: Computer Architecture Summer 2016

ENGIN 112 Intro to Electrical and Computer Engineering

PG - TRB UNIT-X- DIGITAL ELECTRONICS. POLYTECHNIC-TRB MATERIALS

DE58/DC58 LOGIC DESIGN DEC 2014

COSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)

Adders - Subtractors

Chapter 03: Computer Arithmetic. Lesson 03: Arithmetic Operations Adder and Subtractor circuits Design

UNIT III Design of Combinational Logic Circuits. Department of Computer Science SRM UNIVERSITY

Combinational Logic. Jee-Hwan Ryu. School of Mechanical Engineering Korea University of Technology and Education

ELCT201: DIGITAL LOGIC DESIGN

MODULAR CIRCUITS CHAPTER 7

CSE140: Components and Design Techniques for Digital Systems. Decoders, adders, comparators, multipliers and other ALU elements. Tajana Simunic Rosing

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...

INSTITUTEOFAERONAUTICALENGINEERING (Autonomous) Dundigal, Hyderabad

ECE 545 Digital System Design with VHDL Lecture 1A. Digital Logic Refresher Part A Combinational Logic Building Blocks

Binary addition by hand. Adding two bits

3. Combinational Circuit Design

UNSIGNED BINARY NUMBERS DIGITAL ELECTRONICS SYSTEM DESIGN WHAT ABOUT NEGATIVE NUMBERS? BINARY ADDITION 11/9/2018

S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques

CHAPTER VI COMBINATIONAL LOGIC BUILDING BLOCKS

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

Chapter 4: Designing Combinational Systems Uchechukwu Ofoegbu


Lecture 2 Review on Digital Logic (Part 1)

Digital System Design Combinational Logic. Assoc. Prof. Pradondet Nilagupta

Unit 2 Session - 6 Combinational Logic Circuits

Chapter 3 Ctd: Combinational Functions and Circuits

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES

Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4

ECE 341. Lecture # 3

Combinational Logic Design/Circuits

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.

Analog & Digital Electronics Laboratory. Code - CS391. Lab Manual

DIGITAL LOGIC DESIGN PPT

MODEL ANSWER SUMMER 17 EXAMINATION Subject Title: Principles of Digital Techniques

Binary addition (1-bit) P Q Y = P + Q Comments Carry = Carry = Carry = Carry = 1 P Q

Numbers & Arithmetic. Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University. See: P&H Chapter , 3.2, C.5 C.

Menu. 7-Segment LED. Misc. 7-Segment LED MSI Components >MUX >Adders Memory Devices >D-FF, RAM, ROM Computer/Microprocessor >GCPU

ARITHMETIC COMBINATIONAL MODULES AND NETWORKS

We are here. Assembly Language. Processors Arithmetic Logic Units. Finite State Machines. Circuits Gates. Transistors

Review for Test 1 : Ch1 5

( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function

Combinational Logic. Review of Combinational Logic 1

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering

LOGIC CIRCUITS. Basic Experiment and Design of Electronics

Design of Sequential Circuits

DIGITAL LOGIC CIRCUITS

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

LOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE

Cs302 Quiz for MID TERM Exam Solved

DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN

CMSC 313 Lecture 19 Homework 4 Questions Combinational Logic Components Programmable Logic Arrays Introduction to Circuit Simplification

Midterm Exam Two is scheduled on April 8 in class. On March 27 I will help you prepare Midterm Exam Two.

Digital Circuits and Design

Chapter 5 Arithmetic Circuits

Lecture A: Logic Design and Gates

Transcription:

Logic Design with MSI Circuits ว ตถ ประสงค ของบทเร ยน ร จ กวงจรประเภท MSI เข าใจการทำงานของวงจร MSI ท ม ใช อย ท วไป สามารถประย กต ใช วงจร MSI ในการออกแบบวงจรลอจ กแบบต างๆ ได A. Yaicharoen 1

Type of Circuits Type of circuits Number of gates Small-scale integration (SSI) 1-10 Medium-scale integration (MSI) 10-100 Large-scale integration (LSI) 100-1,000 Very-large-scale integration (VLSI) 1,000 up หมายเหต หน งส อบางเล มแบ งวงจรท ม เกตต งแต 1,000,000 เกต ข นไป ให อย ในกล ม ULSI (Ultra-large-scale integration) A. Yaicharoen 2

Multiplexers (MUXs) - also called a data selector Input lines consist of - data lines: 2 n lines - select lines: n lines - there may or may not be an enable line Output line: - output line: 1 line A. Yaicharoen 3

Multiplexer Function -Truth table of a 4:1 multiplexer (without enable) S 1 0 Select inputs S 0 0 0 1 1 0 1 1 Output Y Y = S. + I I 0 I 1 I 2 I 3 1 S0. I0 + S1. S0. I1 + S1. S0. I 2 S1. S0. 3 A. Yaicharoen 4

Multiplexer Function -Truth table of a 4:1 multiplexer (with enable) Enable E Select inputs S 1 S 0 0 X X 0 1 0 0 1 0 1 1 1 0 1 1 1 Output Y Y = E.(S 1.S 0.I 0 + S 1.S 0.I 1 + S 1.S 0.I 2 + S 1.S 0.I 3 ) I 0 I 1 I 2 I 3 A. Yaicharoen 5

Logic Circuit Design using Multiplexer Advantages No need for logic simplification Minimize the IC package count Simplify the logic design A. Yaicharoen 6

Logic Design using MUX Case 1: Number of inputs is equal to number of select lines Design procedure Identify the decimal number corresponding to each minterm in the expression Connect logic 1 level to input lines corresponding to these numbers Connect logic 0 level to the others Connect inputs to selected lines A. Yaicharoen 7

Case1: Inputs = Select lines a three-variable function using a 8-to-1-line multiplexer A. Yaicharoen 8

Example f(x,y,z) = Σm(0,2,3,5) using 8-to-1-line multiplexer A. Yaicharoen 9

Logic Design using MUX Case 2: Number of inputs is higher than number of select lines Procedure 2.1: Reduce the number of inputs to the number of select lines by inspection k-map A. Yaicharoen 10

Case 2 -Truth table of a 3 variable logic circuit Input Output Input Output x y z Y x y z Y 0 0 0 f 0 0 0 1 f 1 0 1 0 f 2 0 1 1 f 3 1 0 0 f 4 1 0 1 f 5 1 1 0 f 6 1 1 1 f 7 A. Yaicharoen 11

Case2.1: Reducing Inputs a 3-variable Boolean function using a 4-to-1-line multiplexer A. Yaicharoen 12

Example f(x,y,z) = Σm(0,2,3,5) using a 4-to-1-line multiplexer A. Yaicharoen 13

Reducing Inputs with K-map A. Yaicharoen 14

Example f(x,y,z) = Σm(0,2,3,5) A. Yaicharoen 15

More on Reducing Inputs (a) Applying input variables y and z to the S 1 and S 0 select lines. (b) Applying input variables x and y to the S 0 and S 1 select lines. A. Yaicharoen 16

Example f(x,y,z) = Σm(0,2,3,5) (a) Applying input variables y and z to the S 1 and S 0 select lines. (b) Applying input variables x and y to the S 0 and S 1 select lines. A. Yaicharoen 17

Reducing 4-input to 3-input A. Yaicharoen 18

Example f(w,x,y,z) = Σm(0,1,5,6,7,9,12,15) A. Yaicharoen 19

Logic Design using MUX Procedure 2.2: Use multiplexer tree when number of inputs exceeds the largest number of inputs on available ICs Can be done by one of these two techniques - connect the MSB input to the enable/strobe input - connect the MSB input to another multiplexer A. Yaicharoen 20

Demultiplexers/Decoders -Performs the reverse operation of a multiplexer Input lines are: - 1 data line - n select lines - maybe 1 enable Output lines are - 2 n output lines A. Yaicharoen 21

Application Example A multiplexer/demultiplexer arrangement for information transmission A. Yaicharoen 22

Decoders A n-to-2 n -line decoder is a circuit that only one of the output line responds to the n-input data. Number of input:output is n:2 n (Note: a demultiplexer is a decoder with an enable input acting as a data input line A BCD to 7-segment decoder is a circuit that 7-bit output will make each segment of the 7-segment lit according to the 4-bit input A. Yaicharoen 23

A. Yaicharoen 24

A. Yaicharoen 25

3-to-8-line Decoder A. Yaicharoen 26

Application Example การใช 3-to-8-line decoder และ or-gate ในการสร างวงจร f1(x2,x1,x0) = Σm(1,2,4,5) และ f2(x2,x1,x0) = Σm(1,5,7) A. Yaicharoen 27

Application Example f 1 (x 2,x 1,x 0 ) = Σm(0,1,3,4,5,6) = Σm(2,7) and f 2 (x 2,x 1,x 0 ) = Σm(1,2,3,4,6) = Σm(0,5,7) A. Yaicharoen 28

Application Example f 1 (x 2,x 1,x 0 ) = ΠM(0,1,3,5) and f 2 (x 2,x 1,x 0 ) = ΠM(1,3,6,7) (a) Using output or-gates. (b) Using output nor-gates. A. Yaicharoen 29

3-to-8-line decoder using nand-gates A. Yaicharoen 30

Application Example f 1 (x 2,x 1,x 0 ) = Σm(0,2,6,7) and f 2 (x 2,x 1,x 0 ) = Σm(3,5,6,7) (a) Using output and-gates. (b) Using output nand-gates. A. Yaicharoen 31

A. Yaicharoen 32

A. Yaicharoen 33

A. Yaicharoen 34

A. Yaicharoen 35

Decoder with Enable Input And-gate 2-to-4-line decoder with an enable input A. Yaicharoen 36

Encoders - Similar to decoders - Usually number of input lines are more than number of output lines Number of input:output is 2 n :n A. Yaicharoen 37

A. Yaicharoen 38

A. Yaicharoen 39

A. Yaicharoen 40

A. Yaicharoen 41

A. Yaicharoen 42

Binary Adders Binary Half-Adder Binary Full-Adder x i y i s i c i 0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 1 x i y i c i-1 s i c i 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 1 1 1 1 1 A. Yaicharoen 43

Binary Full-Adder s i = x i '.y i '.c i +x i '.y i.c i '+x i.y i '.c i '+x i.y i.c i c i+1 = x i.y i + x i.c i + y i.c i A. Yaicharoen 44

Parallel Binary Adder Parallel (ripple) binary adder A. Yaicharoen 45

Binary Subtractor Binary Half-Subtractor Binary Full-Subtractor x i y i d i b i+1 0 0 0 0 0 1 1 1 1 0 1 0 1 1 0 0 x i y i b i d i b i+1 0 0 0 0 0 0 0 1 1 1 0 1 0 1 1 0 1 1 0 1 1 0 0 1 0 1 0 1 0 0 1 1 0 0 0 1 1 1 1 1 A. Yaicharoen 46

Parallel Binary Subtractor Parallel (ripple) binary subtractor A. Yaicharoen 47

Parallel Binary Adder/Subtractor A. Yaicharoen 48

Carry Look-ahead Adder From Boolean expression of the F.A. c i+1 = x i y i + (x i +y i )c i Let s g i = x i y i (carry-generate function) and p i = (x i +y i ) (carry-propagate function) c 1 = g 0 + p 0 c 0 c 2 = g 1 + p 1 c 1 = g 1 + p 1 (g 0 + p 0 c 0 ) = g 1 + p 1 g 0 + p 1 p 0 c 0 A. Yaicharoen 49

Carry Look-ahead Adder (cont.) c 3 = g 2 + p 2 c 2 = g 2 + p 2 (g 1 + p 1 g 0 + p 1 p 0 c 0 ) = g 2 + p 2 g 1 + p 2 p 1 g 0 + p 2 p 1 p 0 c 0... c i+1 = g i + p i g i-1 + p i p i-1 g i-2 +... + p i p i-1...p 1 g 0 + p i p i-1...p 0 c 0 A. Yaicharoen 50

Carry Look-ahead Adder (cont.) Σ Σ Σ A. Yaicharoen 51

BCD Arithmetic BCD Adder Using a 4-bit binary adder to perform two one digit BCD addition a decimal 6 (binary 0 1 1 0) will be added to the result if the sum output is an invalid BCD or if a carry at the MSB is 1 each BCD adder can be cascaded for adding several BCD digits A. Yaicharoen 52

BCD Arithmetic BCD Subtractor Convert the subtrahend to its 9 s complement form Add the result to the minuend If the summation result is an invalid BCD code or if the carry from the MSB is 1, add decimal 6 (binary 0 1 1 0) and the end around carry (EAC) to this sum If the summation result is a valid BCD code, the result is negative and in the 9 s complement form A. Yaicharoen 53

Nine s Complementer Circuit A 9 s complementer circuit is a circuit designed to convert a decimal digit (in BCD code) to its 9 s complement created by adding binary 1 0 1 0 to the 1 s complement of the number (ignore the carry) (Proof is left as a student exercise) A. Yaicharoen 54

Arithmetic Logic Unit (ALU) performs arithmetic and logic operations (depends on the selected mode) Read details and example in section 6.6 A. Yaicharoen 55

Comparators A comparator is a circuit that compares the magnitudes of two binary numbers Input: A i, B i, G i, E i, L i G i = 1 when A i-1 A i-2...a 1 A 0 > B i-1 B i-2...b 1 B 0 E i = 1 when A i-1 A i-2...a 1 A 0 = B i-1 B i-2...b 1 B 0 L i = 1 when A i-1 A i-2...a 1 A 0 < B i-1 B i-2...b 1 B 0 Output: G i+1, E i+1, L i+1 G i+1 = 1 when A i A i-1...a 1 A 0 > B i B i-1...b 1 B 0 E i+1 = 1 when A i A i-1...a 1 A 0 = B i B i-1...b 1 B 0 L i+1 = 1 when A i A i-1...a 1 A 0 < B i B i-1...b 1 B 0 A. Yaicharoen 56

1-bit Comparator A. Yaicharoen 57

Other MSI Circuits Parity generators/checkers Code converters BCD-to-binary converter Binary-to-BCD converter Priority encoders Decimal-to-BCD encoder Octal-to-binary Encoder Decoder/drivers for display devices BCD-to-decimal decoder/driver BCD-to-7-segment decoder/driver A. Yaicharoen 58